Simple Example

Where $H$ is a hash function, and $r$ is a random value to avoid rainbow table attacks.

Required Properties

• Binding
• Hiding

Used in [[Multiparty Computation]]

Pedersen Commitment Scheme

Statistically binding We have a cyclic group $G$ of prime order $p$

A commitment scheme can be made non-interactive using [[Fiat-Shamir (Transform or Heuristic)]]